Towards A Secure and Verifiable Future Internet

نویسندگان

  • Limin Jia
  • Chen Chen
  • Sangeetha A. Jyothi
  • Wenchao Zhou
  • Suyog Mapara
  • Boon Thau Loo
چکیده

In recent years, there have been strong interests in the networking community in designing new Internet architectures. One of the driving forces behind these “clean-slate” designs is the need to address pressing security concerns of the Internet. As a consequence, recent architectures, such as SCION [8] and ICING [5], provide radically new architectures that claim to provide stronger security guarantees. One of the limitations of current proposals is that security claims of these new designs lack formal security proofs – these protocols are evaluated primarily via experimental evaluations and argued via informal reasoning. In this paper, we outline our research agenda on programming language support for implementing secure Internet protocols, and verifying the security properties of these implementations. Central to our work is the use of Secure Network Datalog (SeNDLog) [9], a declarative networking [4] language with cryptographic primitives. SeNDLog extends the Network Datalog (NDLog) declarative networking language with user-defined cryptographic functions. Specifically, our project aims to achieve the following goals. First, we plan to demonstrate that most existing secure Internet routing architectures can be easily expressed in SeNDLog. Second, to facilitate formal proofs of security, we are developing a set of sound reasoning principles over SeNDLog. Using these reasoning principles, we would be able to extract proof obligations in the form of firstorder logic formulas given any SeNDLog program and the security properties in question. Disciplines Computer Sciences Comments Jia, L., Chen, C., Jyothi, S., Zhou, W., Mapara, S., & Loo, B., Towards A Secure and Verifiable Future Internet, Off the Beaten Track: Underrepresented Problems for Programming Language Researchers, 2012 Author(s) Limin Jia, Chen Chen, Sangeetha A. Jyothi, Wenchao Zhou, Suyog Mapara, and Boon Thau Loo This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/688 Towards a Secure and Verifiable Future Internet (Full Presentation) Limin Jia† Chen Chen∗ Sangeetha A. Jyothi∗ Wenchao Zhou∗ Suyog Mapara∗ Boon Thau Loo∗ ∗ University of Pennsylvania † Carnegie Mellon University

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

متن کامل

Towards a Secure and Verifiable Future Internet (Full Presentation)

In recent years, there have been strong interests in the networking community in designing new Internet architectures. One of the driving forces behind these “clean-slate” designs is the need to address pressing security concerns of the Internet. As a consequence, recent architectures, such as SCION [8] and ICING [5], provide radically new architectures that claim to provide stronger security g...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Written and Produced by Galois the Future of Voting End - to - End Verifiable Internet Voting Specification and Feasibility Assessment Study

INTRODUCTION Societies have conducted elections for thousands of years, but technologies used to cast and tally votes have varied and evolved tremendously over that time. In 2015 many of our essential services have moved online, and some people want elections to follow this trend. Overseas voters are particularly interested in an online approach, as their voting processes can require additional...

متن کامل

Verifiable Internet Voting Solving Secure Platform Problem

We present a voter verifiable Internet voting scheme which provides anonymity and eliminates the danger of vote selling even if the computer used by the voter cannot be fully trusted. The ballots cast remain anonymous even the machine does not know the choice of the voter. It makes no sense to buy votes the voter can cheat the buyer even if his machine cooperates with the buyer. Nevertheless, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015